Konrad Zuse's Plankalkül: The First High-Level, "non von Neumann" Programming Language

نویسنده

  • Wolfgang K. Giloi
چکیده

Konrad Zuse was the first person in history to build a working digital computer, a fact that is still not generally acknowledged. Even less known is that in the years 1943–1945, Zuse developed a high-level programming model and, based on it, an algorithmic programming language called Plankalkül (plan calculus). The Plankalkül features binary data structure types, thus supporting a loop-free programming style for logical or relational problems. As a language for numerical applications, the Plankalkül already had the essential features of a “von Neumann language,” though at the level of an operator language. Consequently, the Plankalkül is in some aspects equivalent and in others more powerful than the von Neumann programming model that came to dominate programming for a long time. To find language concepts similar to those of the Plankalkül, one has to look at “non von Neumann languages” such as APL or the relational algebra. This paper conveys the syntactic and semantic flavor of the Plankalkül, without intending to present all its syntactic idiosyncrasies. Rather, it tries to point out that the Plankalkül was not only the first high-level programming language but in some aspects conceptually ahead of the high-level languages that evolved a decade later.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

On the notion of "von Neumann vicious circle" coined by John Backus

“The von Neumann vicious circle” means that non-von Neumann computer architectures cannot be developed because of the lack of widely available and effective non-von Neumann languages. New languages cannot be created because of lack of conceptual foundations for non-von Neumann architectures. The reason is that programming languages are high-level abstract isomorphic copies of von Neumann comput...

متن کامل

Barbara Liskov on Programming, Career, and the Future

Barbara Liskov (http://www.pmg.csail.mit.edu/~liskov) is the Ford Professor of Engineering in MIT's http://www.eecs.mit.edu/ Department of Electrical Engineering and Computer Science and head of its Programming Methodology Group. She has led several major projects, including the design and implementation of CLU, the first language to support data abstraction; Argus, the first high-level languag...

متن کامل

Calculating Different Topological Indices of Von Neumann Regular Graph of Z_(p^α )

By the Von Neumann regular graph of R, we mean the graph that its vertices are all elements of R such that there is an edge between vertices x,y if and only if x+y is a von Neumann regular element of R, denoted by G_Vnr (R). For a commutative ring R with unity, x in R is called Von Neumann regular if there exists x in R such that a=a2 x. We denote the set of Von Neumann regular elements by V nr...

متن کامل

A view of dataflow

In 1946 John von Neumann outlined an organization for computers 1 that has dominated the languages and architecture of machines to this day-the familiar sequential, oneword-at-a-time instruction stream which modifies the contents of a memory. Although the von Neumann model has proved to be a viable and powerful approach to computation, we have chosen to explore other models of computation to de...

متن کامل

Various topological forms of Von Neumann regularity in Banach algebras

We study topological von Neumann regularity and principal von Neumann regularity of Banach algebras. Our main objective is comparing these two types of Banach algebras and some other known Banach algebras with one another. In particular, we show that the class of topologically von Neumann regular Banach algebras contains all $C^*$-algebras, group algebras of compact abelian groups and ...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:
  • IEEE Annals of the History of Computing

دوره 19  شماره 

صفحات  -

تاریخ انتشار 1997